Continuous Quantum Hidden Subgroup Algorithms
نویسندگان
چکیده
In this paper we show how to construct two continuous variable and one continuous functional quantum hidden subgroup (QHS) algorithms. These are respectively quantum algorithms on the additive group of reals R, the additive group R/Z of the reals Rmod 1, i.e., the circle, and the additive group Paths of L paths x : [0, 1] → R in real n-space R. Also included is a curious discrete QHS algorithm which is dual to Shor’s algorithm.
منابع مشابه
Quantum Hidden Subgroup Algorithms: an Algorithmic Toolkit
One of the most promising and versatile approaches to creating new quantum algorithms is based on the quantum hidden subgroup (QHS) paradigm, originally suggested by Alexei Kitaev. This class of quantum algorithms encompasses the Deutsch-Jozsa, Simon, Shor algorithms, and many more. In this paper, our strategy for finding new quantum algorithms is to decompose Shor’s quantum factoring algorithm...
متن کاملQuantum Hidden Subgroup Algorithms: The Devil Is in the Details
We conjecture that one of the main obstacles to creating new non-abelian quantum hidden subgroup algorithms is the correct choice of a transversal.
متن کاملQuantum factoring, discrete logarithms, and the hidden subgroup problem
Amongst the most remarkable successes of quantum computation are Shor’s efficient quantum algorithms for the computational tasks of integer factorisation and the evaluation of discrete logarithms. In this article we review the essential ingredients of these algorithms and draw out the unifying generalization of the so-called abelian hidden subgroup problem. This involves an unexpectedly harmoni...
متن کاملOn Quantum Algorithms for Noncommutative Hidden Subgroups
Quantum algorithms for factoring and finding discrete logarithms have previously been generalized to finding hidden subgroups of finite Abelian groups. This paper explores the possibility of extending this general viewpoint to finding hidden subgroups of noncommutative groups. We present a quantum algorithm for the special case of dihedral groups which determines the hidden subgroup in a linear...
متن کاملHidden Subgroup Quantum Algorithms for a Class of Semi-Direct Product Groups
A quantum algorithm for the Hidden Subgroup Problem over the group Z/pZ o Z/qZ is presented. This algorithm, which for certain parameters of the group qualifies as ‘efficient’, generalizes prior work on related semi-direct product groups. 1998 ACM Subject Classification F.1.2 Modes of Computation, F.2.2 Nonnumerical Algorithms and Problems
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003